The ALTO project at IPN Orsay

In order to probe neutron rich radioactive noble gases produced by photo-fission, a PARRNe1 experiment (Production d'Atomes Radioactifs Riches en Neutrons) has been carried out at CERN. The incident electron beam of 50 MeV was delivered by the LIL machine: LEP Injector Linac. The experiment allowed to compare under the same conditions two production methods of radioactive noble gases: fission induced by fast neutrons and photo-fission. The obtained results show that the use of the electrons is a promising mode to get intense neutron rich ion beams. Thereafter, the success of this photo-fission experiment, a conceptual design for the installation at IPN Orsay of a 50 MeV electron accelerator close to the PARRNe-2 device has been worked out: ALTO Project. This work has started within a collaboration between IPNO, LAL and CERN groups.Comment: 14 pages, pdf file, International School-Seminar on Heavy-Ion Physics 7 (2002

Basic Module Theory over Non-Commutative Rings with Computational Aspects of Operator Algebras

The present text surveys some relevant situations and results where basic Module Theory interacts with computational aspects of operator algebras. We tried to keep a balance between constructive and algebraic aspects.Comment: To appear in the Proceedings of the AADIOS 2012 conference, to be published in Lecture Notes in Computer Scienc

METALLIC ION DEVELOPMENTS AT GANIL

Radioactive ion beams (RIB) are routinely produced at GANIL by fragmentation of the projectile. A possible way to improve the RIB intensity is to increase the primary beam intensity impinging the target. Although high intensities can be obtained with an ECR ion source for gaseous elements, it is more difficult for metallic elements due to the poor ionization efficiency of the source. This report deals with metallic ion beam production at high intensity. Experimental results for Ca, Ni and Fe are presented. The oven and the MIVOC methods are compared

How to obtain lattices from (f,σ,δ)-codes via a generalization of Construction A

We show how cyclic (f,σ,δ)-codes over finite rings canonically induce a Z-lattice in RN by using certain quotients of orders in nonassociative division algebras defined using the skew polynomial f. This construction generalizes the one using certain σ-constacyclic codes by Ducoat and Oggier, which used quotients of orders in non-commutative associative division algebras defined by f, and can be viewed as a generalization of the classical Construction A for lattices from linear codes. It has the potential to be applied to coset coding, in particular to wire-tap coding. Previous results by Ducoat and Oggier are obtained as special cases

An E-unification algorithm for analyzing protocols that use modular exponentiation

Modular multiplication and exponentiation are common operations in modern cryptography. Uni cation problems with respect to some equational theories that these operations satisfy are investigated. Two dierent but related equational theories are analyzed. A uni cation algorithm is given for one of the theories which relies on solving syzygies over multivariate integral polynomials with noncommuting indeterminates. For the other theory, in which the distributivity property of exponentiation over multiplication is assumed, the uni ability problem is shown to be undecidable by adapting a construction developed by one of the authors to reduce Hilbert's 10th problem to the solvability problem for linear equations over semi-rings. A new algorithm for computing strong Gr\u7fobner bases of right ideals over the polynomial semiring Z<X 1 ; : : : ; Xn> is proposed; unlike earlier algorithms proposed by Baader as well as by Madlener and Reinert which work only for right admissible term orderings with the boundedness property, this algorithm works for any right admissible term ordering. The algorithms for some of these uni cation problems are expected to be integrated into Research supported in part by the NSF grant nos. CCR-0098114 and CDA-9503064, the ONR grant no. N00014-01-1-0429, and a grant from the Computer Science Research Institute at Sandia National Labs